Fifty years of The Journal of Combinatorial Theory

نویسندگان

  • Hélène Barcelo
  • Bruce Rothschild
  • S. Ole Warnaar
چکیده

The idea of a specialist journal focused on combinatorics was first conceived in the early 1960s by Frank Harary and Gian-Carlo Rota, and successfully brought to fruition a few years later with the publication of the first issue, in 1966, of the Journal of Combinatorial Theory. Many eminent mathematicians contributed to this issue, including Paul Erdős, Ron Graham, Daniel Kleitman, and Marcel-Paul Schützenberger. These formative years, as well as the split of the journal into a Series A and B, is described wonderfully in an article commemorating Rota, published in JCTA in 2000 and written by Edwin Beschler, an editor at Academic Press at the time the journal was founded [2]. We will continue the story by highlighting some of the developments of JCTA during the time we were involved in the journal, both as Managing Editors and Editors-in-Chief. This roughly covers the period 1969–2015. When Bruce Rothschild was at MIT as a post-doc, Theodore Motzkin was passing through Cambridge, Massachusetts, on his way back to UCLA. He met with Gian-Carlo Rota who told him about the pending reorganization of JCT into JCTA and JCTB. As one of the original editorial board members of JCT, Rota asked Motzkin if he would consider becoming the Editor-in-Chief of Series A. Motzkin said he would think about it. As Rota told it, after a short pause, Motzkin said “yes”! Much later, Motzkin explained that he did a quick ‘calculation’, figuring that since Bruce Rothschild was soon to be joining UCLA, and Basil Gordon was already there, he could ask both to serve as Managing Editors. Gordon had previously worked with the Pacific Journal of Mathematics, which was edited at UCLA, and Motzkin knew he was an extraordinary scholar, very broad in his mathematical knowledge and interests, and extremely quick. He also knew he would be willing to take on this task, and so it transpired that in 1969 the new journal JCTA was effectively run from UCLA with Motzkin as Editor-in-Chief and Basil Gordon and Bruce Rothschild as Managing Editors. The first thing that had to be done was to decide the fate of papers submitted to JCT, but which would only appear after the split into series A and B. Together with the editors for JCTB, Bill Tutte and Dan Younger, it had to be decided which papers should be routed to JCTB and which to JCTA. Typically papers on graph theory or matroids went

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs

The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...

متن کامل

A convex combinatorial property of compact sets in the plane and its roots in lattice theory

K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

PERFORMANCE COMPARISON OF CBO AND ECBO FOR LOCATION FINDING PROBLEMS

The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...

متن کامل

Traffic Impact Assessment of Land Use Proposals: Fifty Years of Australian Experience

Draft traffic impact assessment (TIA) guidelines for various landuses in general, and for high traffic generating buildings in particular, were published in Iran in the middle of 2016. In formulating that report the Traffic Committee of the Iranian Building Engineering Order reviewed international experience, including that of Australia. Traffic impact assessment started in Australia in the 196...

متن کامل

THIN WALLED STEEL SECTIONS’ FREE SHAPE OPTIMIZATION USING CHARGED SYSTEM SEARCH ALGORITHM

Graph theory based methods are powerful means for representing structural systems so that their geometry and topology can be understood clearly. The combination of graph theory based methods and some metaheuristics can offer effective solutions for complex engineering optimization problems. This paper presents a Charged System Search (CSS) algorithm for the free shape optimizations of thin-wall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 144  شماره 

صفحات  -

تاریخ انتشار 2016